package com.banmao.algorithm.No401To500.No513;

public class Answer {

    public static void main(String[] args) {
        Solution1 solution = new Solution1();

        TreeNode root = new TreeNode(1, new TreeNode(2, new TreeNode(4), null), new TreeNode(3, new TreeNode(5, new TreeNode(7), null), new TreeNode(6)));
        int result = solution.findBottomLeftValue(root);
        System.out.println(result);

    }

}
